Some open problems
نویسنده
چکیده
We discuss some challenging open problems in the geometric control theory and sub-Riemannian geometry. It is getting harder to prove theorems and easier to force other people to prove them when you are sixty. Some colleagues asked me to describe interesting open problems in geometric control and sub-Riemannian geometry. Here I list few really challenging problems; some of them are open for a long time and were publicly or privately stated by well-known experts: J.-M. Coron, I. Kupka, R. Montgomery, B. Shapiro, H. Sussmann, and others. I. Singularities of time-optimal trajectories. Let f, g be a pair of smooth (i. e. C∞) vector fields on a n-dimensional manifold M . We study time-optimal trajectories for the system q̇ = f(q) + ug(q), |u| ≤ 1, q ∈M, with fixed endpoint. Admissible controls are just measurable functions and admissible trajectories are Lipschitz curves in M . We can expect more regularity from time-optimal trajectories imposing reasonable conditions on the pair of vector fields. A. (f, g) is a generic pair of vector fields. Optimal trajectories cannot be all smooth; are they piecewise smooth? This is true for n = 2. More precisely, if dimM = 2, then any point of M has a neighborhood such that any contained in the neighborhood time-optimal trajectory is piecewise smooth with atmost 1 switching point (see [32, 11]). According to the control ∗SISSA, Trieste & Steklov Math. Inst., Moscow
منابع مشابه
On some open problems in cone metric space over Banach algebra
In this paper we prove an analogue of Banach and Kannan fixed point theorems by generalizing the Lipschitz constat $k$, in generalized Lipschitz mapping on cone metric space over Banach algebra, which are answers for the open problems proposed by Sastry et al, [K. P. R. Sastry, G. A. Naidu, T. Bakeshie, Fixed point theorems in cone metric spaces with Banach algebra cones, Int. J. of Math. Sci. ...
متن کاملAn electromagnetism-like metaheuristic for open-shop problems with no buffer
This paper considers open-shop scheduling with no intermediate buffer to minimize total tardiness. This problem occurs in many production settings, in the plastic molding, chemical, and food processing industries. The paper mathematically formulates the problem by a mixed integer linear program. The problem can be optimally solved by the model. The paper also develops a novel metaheuristic base...
متن کاملA Mixed Integer Programming Formulation for the Heterogeneous Fixed Fleet Open Vehicle Routing Problem
The heterogeneous fixed fleet open vehicle routing problem (HFFOVRP) is one of the most significant extension problems of the open vehicle routing problem (OVRP). The HFFOVRP is the problem of designing collection routes to a number of predefined nodes by a fixed fleet number of vehicles with various capacities and related costs. In this problem, the vehicle doesn’t return to the depot after se...
متن کاملSome Perspectives of Machine Repair Problems
In this article, we survey machine repair problems (MRP) with an emphasis on historical developments of queuing models of practical importance. The survey proceeds historically, starting with developments in 1985, when the first published review on machine interference models appeared. We attempt to elaborate some basic MRP models of the real life congestion situations. The brief survey of some...
متن کاملGeneralized Cyclic Open Shop Scheduling and a Hybrid Algorithm
In this paper, we first introduce a generalized version of open shop scheduling (OSS), called generalized cyclic open shop scheduling (GCOSS) and then develop a hybrid method of metaheuristic to solve this problem. Open shop scheduling is concerned with processing n jobs on m machines, where each job has exactly m operations and operation i of each job has to be processed on machine i . However...
متن کاملSome numerical radius inequalities with positive definite functions
Using several examples of positive definite functions, some inequalities for the numerical radius of matrices are investigated. Also, some open problems are stated.
متن کامل